6 J un 2 00 8 FEYNMAN GRAPHS , ROOTED TREES , AND RINGEL - HALL ALGEBRAS
نویسنده
چکیده
We construct symmetric monoidal categoriesLRF ,LFG of rooted forests and Feynman graphs. These categories closely resemble finitary abelian categories, and in particular, the notion of Ringel-Hall algebra applies. The Ringel-Hall Hopf algebras of LRF ,LFG, HLRF ,HLFG are dual to the corresponding Connes-Kreimer Hopf algebras on rooted trees and Feynman diagrams. We thus obtain an interpretation of the Connes-Kreimer Lie algebras on rooted trees and Feynman graphs as Ringel-Hall Lie algebras.
منابع مشابه
Feynman Graphs, Rooted Trees, and Ringel-hall Algebras
We construct symmetric monoidal categoriesLRF ,LFG of rooted forests and Feynman graphs. These categories closely resemble finitary abelian categories, and in particular, the notion of Ringel-Hall algebra applies. The Ringel-Hall Hopf algebras of LRF ,LFG, HLRF ,HLFG are dual to the corresponding Connes-Kreimer Hopf algebras on rooted trees and Feynman diagrams. We thus obtain an interpretation...
متن کاملPre-lie Algebras and Incidence Categories of Colored Rooted Trees
The incidence category CF of a family F of colored posets closed under disjoint unions and the operation of taking convex sub-posets was introduced by the author in [12], where the Ringel-Hall algebra HF of CF was also defined. We show that if the Hasse diagrams underlying F are rooted trees, then the subspace nF of primitive elements of HF carries a pre-Lie structure, defined over Z, and with ...
متن کاملColored Trees and Noncommutative Symmetric Functions
Let CRF S denote the category of S-colored rooted forests, and HCRFS denote its Ringel-Hall algebra as introduced in [6]. We construct a homomorphism from a K+ 0 (CRF S)–graded version of the Hopf algebra of noncommutative symmetric functions to HCRFS . Dualizing, we obtain a homomorphism from the Connes-Kreimer Hopf algebra to a K+ 0 (CRF S)–graded version of the algebra of quasisymmetric func...
متن کاملDecomposing almost complete graphs by random trees
An old conjecture of Ringel states that every tree with m edges decomposes the complete graph K2m+1. The best lower bound for the order of a complete graph decomposed by a given tree with m edge is O(m). We show that asymptotically almost surely a random tree with m edges and p = 2m + 1 a prime decomposes K2m+1(r) for every r ≥ 2, the graph obtained from the complete graph K2m+1 by replacing ea...
متن کاملGraceful and harmonious labellings of trees
We establish that all trees on at most 27 vertices admit graceful labellings and all trees on at most 26 vertices admit harmonious labellings. A graceful labelling of a graph G with q edges is an injection f : V (G) → {0, 1, 2, . . . , q} such that when each edge xy ∈ E(G) is assigned the label, |f(x) − f(y)|, all of the edge labels are distinct. A graph which admits a graceful labelling is sai...
متن کامل